Probabilistic Methods Of Searching Local Minimum in Rectangular Bin-Packing Problem Based on its Block Structure
نویسندگان
چکیده
The problem of rectangular objects packing into a semi-endless strip is under consideration. Here we propose to solve this problem by linear cutting approximation that may be presented as block structure of packing. Sometimes it becomes necessary to rearrange elements inside linear cutting blocks. The determined method of “reconstruction”(REC) proposed below helps to get solutions close to optimal for some classes of problems. But as usual REC does not ensure even local minimum. Two probabilistic methods that can ensure the best goal function parameters are considered in the paper: genetic algorithm and dynamic sorting. Numerical experiment results are shown.
منابع مشابه
Abstract: Packing rectangular shapes into a rectangular space is one of the most important discussions on Cutting & Packing problems (C;P) such as: cutting problem, bin-packing problem and distributor's pallet loading problem, etc. Assume a set of rectangular pieces with specific lengths, widths and utility values. Also assume a rectangular packing space with specific width and length. The obj...
متن کاملThe 2-Dimensional Probabilistic Bin Packing Problem : An average case analysis of the FBS algorithm
In the probabilistic two-dimensional Bin Packing problem (2D-PBPP), one is asked to pack a random number of rectangular items, without overlap and any rotation, into the minimum number of identical square bins. In this paper we consider the re-optimization procedure used for solving probabilistic combinatorial optimization problems and an approximation of this strategy: the redistribution strat...
متن کاملبررسی تعدادی از روشهای آماری جهت ترسیم نمودار کنترل مشاهدات انفرادی برای فرایندهای اتورگرسیو
Packing rectangular shapes into a rectangular space is one of the most important discussions on Cutting & Packing problems (C;P) such as: cutting problem, bin-packing problem and distributor's pallet loading problem, etc. Assume a set of rectangular pieces with specific lengths, widths and utility values. Also assume a rectangular packing space with specific width and length. The objective fu...
متن کاملروشی جدید برای چیدمان قطعات مستطیل شکل در یک فضای مستطیل شکل
Packing rectangular shapes into a rectangular space is one of the most important discussions on Cutting & Packing problems (C;P) such as: cutting problem, bin-packing problem and distributor's pallet loading problem, etc. Assume a set of rectangular pieces with specific lengths, widths and utility values. Also assume a rectangular packing space with specific width and length. The objective fun...
متن کاملThe 2-Dimensional Probabilistic Bin Packing Problem : An average case analysis
In the probabilistic two-dimensional Bin Packing problem (2D-PBPP), one is asked to pack a random number of rectangular items, without overlap and any rotation, into the minimum number of identical square bins. In this paper we consider the re-optimization procedure used for solving probabilistic combinatorial optimization problems and an approximation of this strategy: the redistribution strat...
متن کامل